Routing and wavelength assignment issues in the presence of wavelength conversion for all-optical networks

algorithm algorithm (Numerical results will be discussed in Section N). mnveraion We argue in this paper thnt any RWA algorithm h this paper, we propose a new dynamic RWA algorithm, needs to take into aeconnt the underlying wavelength conversion called weighred least-congesnon routing and firsv'it for two IFBJons: 1) wavelength converter placement is usually wavelength assignrnenl (WLCR-FF), which considers the done at a much earlier stage during capacity planning: 2) one of distribution of free wavelengths and the lengths of each mute the key advantags Of an a l l Q P m network is its re. jointly. In addition, we propose an efficient heuristic converter wnfWbility in that olacement aleoithm called Minimum Blockinp ProbabiliN primary vehicles for i m p m a g the blocking pe*orman= of congestion routing (FPLC) [g] algoriti,,,,s WoISe